منابع مشابه
Using Regular Expressions to Express Bowing Patterns for String Players
The study of bowing is critically important for string players. Traditional bowing annotations are a valuable part of orchestral and individual documentation, but they do not help the performer to search a piece for other passages that should be bowed the same way, or to identify alternative bowing styles. We introduce a notation based on regular expressions that describes patterns of notes in ...
متن کاملRegular Expressions as Violin Bowing Patterns
String players spend a significant amount of practice time creating and learning bowings. These may be indicated in the music using up-bow and down-bow symbols, but those traditional notations do not capture the complex bowing patterns that are latent within the music. Regular expressions, a mathematical notation for a simple class of formal languages, can describe precisely the bowing patterns...
متن کاملRegular Expressions with Dynamic Name Binding
Nominal Kleene algebra (NKA) is a formalism to specify trace languages with name generation; it extends standard regular expressions with a name binding construct. NKA has been proved complete over a natural nominal language model. Moreover, it has been shown that NKA expressions can be translated into a species of nondeterministic nominal automata, thus providing one half of a Kleene theorem. ...
متن کاملLearning Memory Access Patterns
The explosion in workload complexity and the recent slow-down in Moore’s law scaling call for new approaches towards efficient computing. Researchers are now beginning to use recent advances in machine learning in software optimizations, augmenting or replacing traditional heuristics and data structures. However, the space of machine learning for computer hardware architecture is only lightly e...
متن کاملEfficient classification of strings using regular expressions
This paper presents a new method of compiling a large set of patterns, described in regular expression syntax, into a new data structure, in order to efficiently determine at runtime which of the patterns is matched by an input string. This problem arises in network security and a wide variety of other businesses. In evaluation tests on data sets used for security information and event manageme...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Architecture and Code Optimization
سال: 2009
ISSN: 1544-3566,1544-3973
DOI: 10.1145/1498690.1498693